home *** CD-ROM | disk | FTP | other *** search
/ Power Programmierung 2 / Power-Programmierung CD 2 (Tewi)(1994).iso / c / library / dos / diverses / leda / incl / hash.h < prev    next >
Encoding:
C/C++ Source or Header  |  1991-11-21  |  3.0 KB  |  82 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  2.1.1                                                 11-15-1991
  4. +
  5. +
  6. +  hash.h
  7. +
  8. +
  9. +  Copyright (c) 1991  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16.  
  17.  
  18. //------------------------------------------------------------------------------
  19. //
  20. // hash  (data structure: hashing with chaining)
  21. //
  22. // Stefan Naeher (1989)
  23. //
  24. //------------------------------------------------------------------------------
  25.  
  26. #ifndef HASHH
  27. #define HASHH
  28.  
  29. #include <LEDA/ch_hashing.h>
  30.  
  31. typedef ch_hashing_el* hash_item;
  32.  
  33. #define hash(keytype,infotype) name3(keytype,infotype,hash)
  34.  
  35. #define HFCT(keytype,infotype) name3(keytype,infotype,_hashfct)
  36.  
  37. #define HFCTC(keytype,infotype) name3(keytype,infotype,_const_hashfct)
  38.  
  39. #define hashdeclare2(keytype,infotype)\
  40. \
  41. typedef int (*HFCT(keytype,infotype))(keytype&);\
  42. typedef int (*HFCTC(keytype,infotype))(const keytype&);\
  43. \
  44. struct hash(keytype,infotype) : public ch_hashing {\
  45. \
  46. int  cmp(ent& x, ent& y) const { return compare(*(keytype*)&x,*(keytype*)&y); }\
  47. void clear_key(ent& x)   const { Clear(*(keytype*)&x); }\
  48. void clear_inf(ent& x)   const { Clear(*(infotype*)&x); }\
  49. void copy_key(ent& x)    const { Copy(*(keytype*)&x); }\
  50. void copy_inf(ent& x)    const { Copy(*(infotype*)&x); }\
  51. void print_key(ent& x)   const { Print(*(keytype*)&x); }\
  52. \
  53. int        defined(keytype y) const { return ch_hashing::member(Ent(y)); }\
  54. hash_item  lookup(keytype y)  const { return ch_hashing::lookup(Ent(y)); }\
  55. void       change_inf(hash_item it, infotype i)\
  56.                                     { ch_hashing::change_inf(it,Ent(i)); }\
  57. hash_item  insert(keytype y,infotype x)\
  58.                                     { return ch_hashing::insert(Ent(y),Ent(x));}\
  59. void      del(keytype y)            { delete ch_hashing::del(Ent(y)); } \
  60. void      del_item(hash_item it)    { del(key(it)); } \
  61. keytype   key(hash_item it)   const { return keytype(ch_hashing::key(it)); }\
  62. infotype  inf(hash_item it)   const { return infotype(ch_hashing::inf(it)); } \
  63. infotype  info(hash_item it)  const { return infotype(ch_hashing::inf(it)); } \
  64. \
  65. hash(keytype,infotype)()                                                    {}\
  66. hash(keytype,infotype)(int s)                            :ch_hashing(s)               {}\
  67. hash(keytype,infotype)(HFCT(keytype,infotype) f)         :ch_hashing(hash_fct(f))     {}\
  68. hash(keytype,infotype)(HFCTC(keytype,infotype) f)        :ch_hashing(hash_fct(f))     {}\
  69. hash(keytype,infotype)(int s, HFCT(keytype,infotype) f)  :ch_hashing(s,hash_fct(f))   {}\
  70. hash(keytype,infotype)(int s, HFCTC(keytype,infotype) f) :ch_hashing(s,hash_fct(f))   {}\
  71. ~hash(keytype,infotype)()   { remove(); }\
  72. } ;
  73.  
  74.  
  75. // ----------------------------------------------------------------
  76. // iteration
  77. // ----------------------------------------------------------------
  78.  
  79. #define forall_hash_items(i,D) for((D).init_iterator(); i=(D).move_iterator();)
  80.  
  81. #endif
  82.